SPOJ/MDIGITS - 3928. Counting Digits/mdigits.cpp

   1 using namespace std;
   2 #include <algorithm>
   3 #include <iostream>
   4 #include <iterator>
   5 #include <numeric>
   6 #include <sstream>
   7 #include <fstream>
   8 #include <cassert>
   9 #include <climits>
  10 #include <cstdlib>
  11 #include <cstring>
  12 #include <string>
  13 #include <cstdio>
  14 #include <vector>
  15 #include <cmath>
  16 #include <queue>
  17 #include <deque>
  18 #include <stack>
  19 #include <list>
  20 #include <map>
  21 #include <set>
  22
  23 #define foreach(x, v) for (typeof (v).begin() x=(v).begin(); x !=(v).end(); ++x)
  24 #define For(i, a, b) for (int i=(a); i<(b); ++i)
  25 #define D(x) cout << #x " is " << x << endl
  26
  27 int count(int x, int digit) {
  28     int power = 1, ans = 0;
  29     int left = x, right = 0;
  30     while (left > 0) {
  31         int current = left % 10;
  32         left /= 10;
  33         ans += left * power;
  34         if (current == digit) {
  35             ans += right + 1;
  36         } else if (current > digit) {
  37             ans += power;
  38         }
  39         power *= 10;
  40         right = x % power;
  41     }
  42     if (digit == 0) {
  43         ans -= (power - 1) / 9;
  44     }
  45     return ans;
  46 }
  47
  48 int main(){
  49     int a, b;
  50     while (cin >> a >> b) {
  51         if (a == 0 and b == 0) break;
  52         if (a > b) swap(a, b);
  53         int ans[10];
  54
  55         for (int d = 0; d <= 9; ++d) {
  56             ans[d] = count(b, d);
  57             if (a - 1 > 0) ans[d] -= count(a - 1, d);
  58         }
  59
  60         for (int i = 0; i <= 9; ++i) {
  61             if (i > 0) printf(" ");
  62             printf("%d", ans[i]);
  63         }
  64         printf("\n");
  65
  66
  67     }
  68     return 0;
  69 }